翻訳と辞書 |
Computational complexity of mathematical operations : ウィキペディア英語版 | Computational complexity of mathematical operations
The following tables list the running time of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine.〔A. Schönhage, A.F.W. Grotefeld, E. Vetter: ''Fast Algorithms—A Multitape Turing Machine Implementation'', BI Wissenschafts-Verlag, Mannheim, 1994〕 See big O notation for an explanation of the notation used. Note: Due to the variety of multiplication algorithms, ''M''(''n'') below stands in for the complexity of the chosen multiplication algorithm. ==Arithmetic functions==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Computational complexity of mathematical operations」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|